Streamlining of DFA based Pattern Matchers

Perceptron-based Fusion of Multiple Fingerprint Matchers

In this paper, a neural fusion rule for fingerprint verification is presented. The person to be identified submits to the system her/his fingerprint and her/his identity. Multiple fingerprint matchers provide a set of verification scores, that are then fused by a perceptronbased method. The weights of such perceptron are explicitly optimised to increase the separation between genuine users and ...

A Memory-Efficient Pattern Matching with Hardware-Based Bit-Split String Matchers for Deep Packet Inspection

This paper proposes a hardware-based parallel pattern matching engine using a memory-based bit-split string matcher architecture. The proposed bit-split string matcher separates the transition table from the state table, so that state transitions towards the initial state are not stored. Therefore, total memory requirements can be minimized. key words: computer network security, deep packet ins...

Efficient Design and Implementation of DFA Based Pattern Matching on Hardware

Pattern matching is a crucial task in several critical network services such as intrusion detection. In this paper we present an efficient implementation of the DFA with optimized area and optimized memory by the introduction of state minimization algorithm. By using minimized DFA the clock frequency reduces to 40% of the original and the area also reduces to 30%. This optimized architecture of...

A Memory Efficient DFA Using Compression and Pattern Segmentation

Streamlining Pattern Support Assessment for Service Composition Languages

Various process modeling formalisms have been leveraged to specify service compositions. For assessing the expressiveness of similar languages and for providing best practice knowledge, patterns have frequently been proposed. However, the pattern catalogs proposed do not all share and document the criteria that were used for assessing pattern support. Furthermore, the scaling of the support mea...